The Cyclic Sieving Phenomenon for Faces of Cyclic Polytopes
نویسندگان
چکیده
A cyclic polytope of dimension d with n vertices is a convex polytope combinatorially equivalent to the convex hull of n distinct points on a moment curve in R. In this paper, we prove the cyclic sieving phenomenon, introduced by Reiner-StantonWhite, for faces of an even-dimensional cyclic polytope, under a group action that cyclically translates the vertices. For odd-dimensional cyclic polytopes, we enumerate the faces that are invariant under an automorphism that reverses the order of the vertices and an automorphism that interchanges the two end vertices, according to the order on the curve. In particular, for n = d + 2, we give instances of the phenomenon under the groups that cyclically translate the odd-positioned and even-positioned vertices, respectively. Research partially supported by the National Science Council, Taiwan under grant NSC grants 982115-M-390-002-MY3 Research partially supported by NSC grants 97-2115-M-251-001-MY2 Research partially supported by NSC grants 98-2115-M-127-001 the electronic journal of combinatorics 17 (2010), #R47 1
منابع مشابه
The Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes
The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge’s q = −1 phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in typ...
متن کاملOn Gale and braxial polytopes
Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...
متن کاملThe Cyclic Sieving Phenomenon for Non-Crossing Forests
In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.
متن کاملCyclic Sieving of Noncrossing Partitions for Complex Reflection Groups
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
متن کاملThe cyclic sieving phenomenon
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010